Efficient Secure Multi-party Computation (Extended Abstract)
نویسندگان
چکیده
منابع مشابه
A Secure Multi-Party Computation Protocol for Malicious Computation Prevention for preserving privacy during Data Mining
Secure Multi-Party Computation (SMC) allows parties with similar background to compute results upon their private data, minimizing the threat of disclosure. The exponential increase in sensitive data that needs to be passed upon networked computers and the stupendous growth of internet has precipitated vast opportunities for cooperative computation, where parties come together to facilitate com...
متن کاملEfficient Electronic Gambling: An Extended Implementation of the Toolbox for Mental Card Games
There are many wonderful protocols in cryptography which are still waiting for their realization. Here we consider efficient solutions for secure electronic card games. Our contribution seems to be the first known practical implementation that requires no trusted third-party and simultaneously keeps the players’ strategies confidential. The provided open source library LibTMCG can be used for c...
متن کاملEfficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert adversaries. They were able to utilize cut and...
متن کاملQuorum-Based Secure Multi-party Computation
This paper describes efficient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to access structures based on quorum systems, which are collections of sets enjoying a naturallymotivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general,...
متن کاملEfficient Three-Party Computation from Cut-and-Choose
With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols—in particular, the cut-and-choose approach—can be adapted to the multi-party setting. In this work we explore the possibility of using cut-and-choose for practical...
متن کامل